Inverse Monoids with a Natural Semilattice Ordering

نویسنده

  • JONATHAN LEECH
چکیده

An inverse semigroup is a semigroup S such that for each x e S there exists a unique inverse x~ & S such that both xx~x=x and x~xx~=x~\ This condition is equivalent to S both being (von Neumann) regular and having all idempotents commute. The classic example of such a semigroup is the symmetric inverse semigroup Ix of all partial bijections on a set X under the standard composition of partial functions on X. More generally, for any reasonably endowed mathematical object Q, the set /n of all partial symmetries of Q (bijections between subobjects of Q respecting all relevant structure) forms an inverse semigroup, the symmetric inverse semigroup of Q. Nearly all such semigroups, however, are more than mere inverse semigroups. Clearly such semigroups possess both an identity 1 and a zero 0, so that one has at least inverse monoids with zero; but of greater consequence is the fact that the natural partial order on the semigroup (given by x ^y if and only if y = yy~x =xy~y) usually possesses infima of arbitrary non-empty subsets. When this occurs, every element x has a fixed point idempotent f[x] = 1 AX which is maximal among those idempotents lying beneath x in the natural partial order. (For example, in the symmetric inverse semigroup on a set X, infima are given by intersections, inf,e/ OLJ = H/e/ h while the fixed point idempotent f[a] of a partial bijection a is the identity map of its set of fixed points.) What is more, multiplication always distributes over the induced meet operation so that one obtains a type of semiring structure. These observations are an indication that the class of inverse monoids which are also meet semilattices with respect to their natural partial order are worthy of further investigation. It is the purpose of this paper to initiate just such a study. To do so, it will be convenient to have a single term to denote this class of algebraic structures. The term adopted in this paper is inverse algebra with 'algebra' being understood in the sense of 'universal algebra'. The term should not be confused with the semigroup algebra k[S] of an inverse semigroup S over a field. The paper is divided into six sections, with the first presenting examples and results which are foundational to the rest of the paper. Congruences are considered in the next section, where congruences of inverse algebras are characterized as those monoid congruences that are generated from their restriction to the subalgebra of idempotents. Section 3 studies a number of universal constructions including the (relatively) free generation of inverse algebras from inverse monoids and completions of inverse algebras. The structure and consequent classification of monogenic inverse algebras are given

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Presentations of Factorizable Inverse Monoids

We present a method for constructing factorizable inverse monoids (FIMs) from a group and a semilattice, and show that every FIM arises in this way. We then use this structure to describe a presentation of an arbitrary FIM in terms of presentations of its group of units and semilattice of idempotents, together with some other data. We apply this theory to quickly deduce a well known presentatio...

متن کامل

Ehresmann monoids

Ehresmann monoids form a variety of biunary monoids, that is, monoids equipped with two basic unary operations, the images of which coincide and form a semilattice of projections. The monoid of binary relations BX on any setX with unary operations of domain and range is Ehresmann. Inverse monoids, regarded as biunary submonoids of BX via the Wagner-Preston representation theorem, are therefore ...

متن کامل

Left Adequate and Left Ehresmann Monoids Ii

This article is the second of two presenting a new approach to left adequate monoids. In the first, we introduced the notion of being T -proper, where T is a submonoid of a left adequate monoid M . We showed that the free left adequate monoid on a set X is X∗-proper. Further, any left adequate monoid M has an X∗-proper cover for some set X , that is, there is an X∗proper left adequate monoid M̂ ...

متن کامل

Semilattice ordered inverse semigroups

As Jonathan Leech has pointed out, many natural examples of inverse semigroups are semilattice ordered under the natural partial order. But there are many interesting examples of semilattice ordered inverse semigroups in which the imposed partial order is not the natural one. In this talk we shall explore the structure and properties of these examples and some other questions related to semilat...

متن کامل

Representable Semilattice-Ordered Monoids

We show that no finite set of first-order axioms can define the class of representable semilattice-ordered monoids.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995